A polynomial training algorithm for calculating perceptrons of optimal stability
نویسنده
چکیده
Recomi (Repeated correlation matrix inversion) is a polynomially fast algorithm for searching optimally stable solutions of the perceptron learning problem. For random unbiased and biased patterns it is shown that the algorithm is able to find optimal solutions, if any exist, in at worst O(N) floating point operations. Even beyond the critical storage capacity αc the algorithm is able to find locally stable solutions (with negative stability) at the same speed. There are no divergent time scales in the learning process. A full proof of convergence cannot yet be given, only major constituents of a proof are shown.
منابع مشابه
Modeling of measurement error in refractive index determination of fuel cell using neural network and genetic algorithm
Abstract: In this paper, a method for determination of refractive index in membrane of fuel cell on basis of three-longitudinal-mode laser heterodyne interferometer is presented. The optical path difference between the target and reference paths is fixed and phase shift is then calculated in terms of refractive index shift. The measurement accuracy of this system is limited by nonlinearity erro...
متن کاملA POLYNOMIAL TIME BRANCH AND BOUND ALGORITHM FOR THE SINGLE ITEM ECONOMIC LOT SIZING PROBLEM WITH ALL UNITS DISCOUNT AND RESALE
The purpose of this paper is to present a polynomial time algorithm which determines the lot sizes for purchase component in Material Requirement Planning (MRP) environments with deterministic time-phased demand with zero lead time. In this model, backlog is not permitted, the unit purchasing price is based on the all-units discount system and resale of the excess units is possible at the order...
متن کاملComputing Time-varying Stability Radii via Discounted Optimal Control
The problem of calculating the maximal Lyapunov exponent of a discrete inclusion (or equivalently its generalized spectral radius) is formulated as an average yield optimal control problem. It is shown that the maximal value of this problem can be approximated by the maximal value of discounted optimal control problems, where for irreducible inclusions the convergence is linear in the discount ...
متن کاملOn the calculation of time-varying stability radii
The problem of calculating the maximal Lyapunov exponent (generalized spectral radius) of a discrete inclusion is formulated as an average yield optimal control problem. It is shown that the maximal value of this problem can be approximated by the maximal value of discounted optimal control problems, where for irreducible inclusions the convergence is linear in the discount rate. This result is...
متن کاملGlobal optimization of mixed-integer polynomial programming problems: A new method based on Grobner Bases theory
Mixed-integer polynomial programming (MIPP) problems are one class of mixed-integer nonlinear programming (MINLP) problems where objective function and constraints are restricted to the polynomial functions. Although the MINLP problem is NP-hard, in special cases such as MIPP problems, an efficient algorithm can be extended to solve it. In this research, we propose an algorit...
متن کامل